Kraft - Chaitin Inequality
نویسندگان
چکیده
Kraft’s inequality [9] is essential for the classical theory of noiseless coding [1, 8]. In algorithmic information theory [5, 7, 2] one needs an extension of Kraft’s condition from finite sets to (infinite) recursively enumerable sets. This extension, known as Kraft-Chaitin Theorem, was obtained by Chaitin in his seminal paper [4] (see also, [3, 2], [10]). The aim of this note is to offer a simpler proof of Kraft-Chaitin Theorem based on a new construction of the prefix-free code.
منابع مشابه
Kraft-chaitin Inequality Revisited 1
Kraft's inequality [9] is essential for the classical theory of noiseless coding [1, 8]. In algorithmic information theory [5, 7, 2] one needs an extension of Kraft's condition from nite sets to (in nite) recursively enumerable sets. This extension, known as Kraft-Chaitin Theorem, was obtained by Chaitin in his seminal paper [4] (see also, [3, 2]). The aim of this note is to o er a simpler proo...
متن کاملFree-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem
First, the dual set of a finite prefix–free set is defined. Using this notion we describe equivalent conditions for a finite prefix–free set to be indefinitely extendible. This lead to a simple proof for the Kraft– Chaitin Theorem. Finally, we discuss the influence of the alphabet size on the indefinite extensibility property.
متن کاملComplexity and Randomness
2 Random finite strings 7 2.1 Plain Kolmogorov complexity . . . . . . . . . . . . . . . . . . 7 2.2 Prefix-free complexity . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Kraft inequality, Shannon-Fano code . . . . . . . . . . . . . . 9 2.4 The universal semimeasure m . . . . . . . . . . . . . . . . . . 10 2.5 A priori probability . . . . . . . . . . . . . . . . . . . . . . . . 11 2.6 Coding,...
متن کاملAbout Deenitions of Pseudospectra of Closed Operators in Banach Spaces
Our goal, in this paper, is to study some equivalent deenitions of the pseudospectra of a closed linear operator. We start from two deenitions, one with strict inequality and the other with non-strict inequality. The rst deenition makes the pseudospectrum open and the second makes it closed. We will show the subtle diierence between these seemingly almost identical deenitions and the relations ...
متن کاملGeneralized Kraft Inequality and Arithmetic Coding
Algorithms for encoding and decoding finite strings over a finite alphabet are described. The coding operations are arithmetic involving rational numbers li as parameters such that Zi2"i 5 2". This coding technique requires no blocking, and the per-symbol length of the encoded string approaches the associated entropy within E . The coding speed is comparable to that of conventional coding metho...
متن کامل